ar X iv : 1 41 2 . 76 53 v 1 [ cs . D C ] 2 4 D ec 2 01 4 Efficient Polling Protocol for Decentralized Social Networks ∗
نویسنده
چکیده
We address the polling problem in social networks where individuals collaborate to choose the most favorite choice amongst some options, without divulging their vote and publicly exposing their potentially malicious actions. Given this social interaction model, Guerraoui et al. [1], [2] recently proposed polling protocols that do not rely on any central authority or cryptography system, using a simple secret sharing scheme along with verification procedures to accurately compute the poll’s final result. However, these protocols can be deployed safely and efficiently provided that, inter alia, the social graph structure should be transformed into a ring structure-based overlay and the number of participating users is perfect square. Consequently, designing secure and efficient polling protocols regardless these constraints remains a challenging issue. In this paper, we present EPol, a simple decentralized polling protocol that relies on the current state of social graphs. More explicitly, we define one family of social graphs that satisfy what we call the m-broadcasting property (where m is less than or equal to the minimum node degree) and show their structures enable low communication cost and constitute necessary and sufficient condition to ensure vote privacy and limit the impact of dishonest users on the accuracy of the polling output. In a social network of N users with diameter ∆G and D ≤ (m − 1)∆G/2 dishonest ones (and similarly to the works [1], [2] where they considered D < √ N ), a privacy parameter k enables us to obtain the following results: (i) the maximum probability that an honest node’s vote is disclosed with certainty is (D/N) and without certainty is (
منابع مشابه
ar X iv : 1 41 2 . 60 75 v 1 [ cs . D M ] 2 2 O ct 2 01 4 A Generalized Cheeger Inequality ∗
where capG(S, S̄) is the total weight of the edges crossing from S to S̄ = V − S. We show that the minimum generalized eigenvalue λ(LG, LH) of the pair of Laplacians LG and LH satisfies λ(LG, LH) ≥ φ(G,H)φ(G)/8, where φ(G) is the usual conductance of G. A generalized cut that meets this bound can be obtained from the generalized eigenvector corresponding to λ(LG, LH). The inequality complements a...
متن کاملar X iv : 1 41 2 . 84 61 v 1 [ cs . P L ] 2 9 D ec 2 01 4 From Clarity to Efficiency for Distributed Algorithms ∗ Yanhong
This paper describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions can be expressed using high-level queries, especially logic quantifications, over message history sequences. Unfortunately, the programs would ...
متن کاملEfficient Polling Protocol for Decentralized Social Networks
We address the polling problem in social networks where individuals collaborate to choose the most favorite choice amongst some options, without divulging their vote and publicly exposing their potentially malicious actions. Given this social interaction model, Guerraoui et al. [1], [2] recently proposed polling protocols that do not rely on any central authority or cryptography system, using a...
متن کاملERGMs are Hard
We investigate the computational complexity of the exponential random graph model (ERGM) commonly used in social network analysis. This model represents a probability distribution on graphs by setting the log-likelihood of generating a graph to be a weighted sum of feature counts. These log-likelihoods must be exponentiated and then normalized to produce probabilities, and the normalizing const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014